Success probability of integer GPS ambiguity rounding and bootstrapping

Global Positioning System ambiguity resolution is usually based on the integer least-squares principle (Teunissen 1993). Solution of the integer least-squares problem requires both the execution of a search process and an ambiguity decorrelation step to enhance the eciency of this search. Instead of opting for the integer least-squares principle, one might also want to consider less optimal integer solutions, such as those obtained through rounding or sequential rounding. Although these solutions are less optimal, they do have one advantage over the integer least-squares solution: they do not require a search and can therefore be computed directly. However, in order to be con®dent that these less optimal solutions are still good enough for the application at hand, one requires diagnostic measures to predict their rate of success. These measures of con®dence are presented and it is shown how they can be computed and evaluated.